The complexity of classification problems for models of arithmetic

We observe that the classification problem for countable models of arithmetic is Borel complete. On the other hand, the classification problems for finitely generated models of arithmetic and for recursively saturated models of arithmetic are Borel; we investigate the precise complexity of each of these. Finally, we show that the classification problem for pairs of recursively saturated models and for automorphisms of a fixed recursively saturated model are Borel complete.Comment: 15 page

Search for gravitational-lensing signatures in the full third observing run of the LIGO-Virgo network

Gravitational lensing by massive objects along the line of sight to the source causes distortions of gravitational wave-signals; such distortions may reveal information about fundamental physics, cosmology and astrophysics. In this work, we have extended the search for lensing signatures to all binary black hole events from the third observing run of the LIGO--Virgo network. We search for repeated signals from strong lensing by 1) performing targeted searches for subthreshold signals, 2) calculating the degree of overlap amongst the intrinsic parameters and sky location of pairs of signals, 3) comparing the similarities of the spectrograms amongst pairs of signals, and 4) performing dual-signal Bayesian analysis that takes into account selection effects and astrophysical knowledge. We also search for distortions to the gravitational waveform caused by 1) frequency-independent phase shifts in strongly lensed images, and 2) frequency-dependent modulation of the amplitude and phase due to point masses. None of these searches yields significant evidence for lensing. Finally, we use the non-detection of gravitational-wave lensing to constrain the lensing rate based on the latest merger-rate estimates and the fraction of dark matter composed of compact objects

Search for eccentric black hole coalescences during the third observing run of LIGO and Virgo

Despite the growing number of confident binary black hole coalescences observed through gravitational waves so far, the astrophysical origin of these binaries remains uncertain. Orbital eccentricity is one of the clearest tracers of binary formation channels. Identifying binary eccentricity, however, remains challenging due to the limited availability of gravitational waveforms that include effects of eccentricity. Here, we present observational results for a waveform-independent search sensitive to eccentric black hole coalescences, covering the third observing run (O3) of the LIGO and Virgo detectors. We identified no new high-significance candidates beyond those that were already identified with searches focusing on quasi-circular binaries. We determine the sensitivity of our search to high-mass (total mass M>70 M⊙) binaries covering eccentricities up to 0.3 at 15 Hz orbital frequency, and use this to compare model predictions to search results. Assuming all detections are indeed quasi-circular, for our fiducial population model, we place an upper limit for the merger rate density of high-mass binaries with eccentricities 0<e≤0.3 at 0.33 Gpc−3 yr−1 at 90\% confidence level

Ultralight vector dark matter search using data from the KAGRA O3GK run

Among the various candidates for dark matter (DM), ultralight vector DM can be probed by laser interferometric gravitational wave detectors through the measurement of oscillating length changes in the arm cavities. In this context, KAGRA has a unique feature due to differing compositions of its mirrors, enhancing the signal of vector DM in the length change in the auxiliary channels. Here we present the result of a search for U(1)B−L gauge boson DM using the KAGRA data from auxiliary length channels during the first joint observation run together with GEO600. By applying our search pipeline, which takes into account the stochastic nature of ultralight DM, upper bounds on the coupling strength between the U(1)B−L gauge boson and ordinary matter are obtained for a range of DM masses. While our constraints are less stringent than those derived from previous experiments, this study demonstrates the applicability of our method to the lower-mass vector DM search, which is made difficult in this measurement by the short observation time compared to the auto-correlation time scale of DM

Preface

The articles in this issue can be divided into three groups. Krajewski’s article, Yong Cheng’s contribution, and a short note by Rudy Rucker, provide detailed mathematical analysis of Lucas-Penrose type arguments. In the second group, with articles by Arnon Avron, Stepan Holub, Panu Raaikiainen, and Albert Visser, the authors discuss the status and various methodological and technical problems of the anti-mechanist arguments. In essence: what does the problem of “minds vs. machines” really mean, and how can it, and how should it, be formulated? Moreover: How to evaluate the merit of arguments that mix formal mathematics and philosophical considerations? The third group consists of the articles that, while including issues from the other two groups, concentrate of more specific themes: an analysis of Georg Kreisel’s observation that it does not logically follow from the fact that a formal system is subject to the second Gödel incompleteness theorems that there are absolutely no means available to prove its consistency (Jeff Buechner); Per Martin-Löf’s proof that there are no absolute unknowables in constructive mathematics (V. Alexis Peluce); diagonal arguments and Chomsky’s approach to linguistic competence as contrasted with arithmetic competence (David Kashtan); and the role in the anti-mechanist arguments of difficulties in capturing the nature of natural numbers in formal systems (Paula Quinon)

On extending automorphisms of models of Peano Arithmetic

Continuing the earlier research in [10] we give some information on extending automorphisms of models of PA to end extensions and cofinal extensions

Set Theory, Arithmetic, and Foundations of Mathematics: Theorems, Philosophies

A collection of remarkable papers from various areas of mathematical logic, written by outstanding members of the field